Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
نویسنده
چکیده
Citation for published version (APA): Bahr, P. (2013). Convergence in infinitary term graph rewriting systems is simple (extended abstract). In R. Echahed, & D. Plump (Eds.), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013 (pp. 17-28). Open Publishing Association. Electronic Proceedings in Theoretical Computer Science, Vol.. 110, DOI: 10.4204/EPTCS.110.4
منابع مشابه
Convergence in Infinitary Term Graph Rewriting Systems is Simple
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to model non-strict evaluation. In this paper, we unify term graph rewriting and infinitary term rewriting thereby addressing both components of laz...
متن کاملModes of Convergence for Term Graph Rewriting
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However, this endeavour is impaired by the lack of an appropriate counterpart of infinitary rewriting on the side of term graphs. We aim to fill this gap by devising tw...
متن کاملBöhm Reduction in Infinitary Term Graph Rewriting Systems
The confluence properties of lambda calculus and orthogonal term rewriting do not generalise to the corresponding infinitary calculi. In order to recover the confluence property in a meaningful way, Kennaway et al. [11, 10] introduced Böhm reduction, which extends the ordinary reduction relation so that ‘meaningless terms’ can be contracted to a fresh constant ⊥. In previous work, we have estab...
متن کاملInfinitary Term Graph Rewriting is Simple, Sound and Complete
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the metric formalisation of the calculus. By showing that the resulting calculi simulate the corresponding well-established infinitary calculi of ter...
متن کاملModular Implementation of Programming Languages and a Partial Order Approach to Infinitary Rewriting
This dissertation is a collection of nine research papers pertaining to two independent areas of research. In the first part, entitled Modular Implementation of Programming Languages, we develop techniques for implementing programming languages in a modular fashion. Within this problem domain, we focus on operations on typed abstract syntax trees with the goal of developing a framework that fac...
متن کامل